Dna Compression Using Hash Based Data Structure
نویسندگان
چکیده
DNA Sequences making up any organism comprise the basic blueprint of that organism so that understanding and analyzing different genes within sequences has become an extremely important task. Biologists are producing huge volumes of DNA sequences every day that makes genome sequence database growing exponentially. The databases such as EMBL, GenBank represent millions of DNA sequences filling many thousands of gigabytes computer storage capacity and the databases are doubled in size every 6-8 months. Hence an efficient algorithm to compress DNA sequence is required. Though there are many text compression algorithms, they are not well suited for the characteristics of DNA sequences. There are algorithms for DNA compression which takes advantage of repetitive nature of DNA fragments within the sequence where as few of the other algorithms are written for the non repeated patterns within DNA sequences. In this paper, we represent an algorithm which is based on hash based data structure to compress DNA sequences. The proposed algorithm performs equally well for both repeated and non-repeated patterns within the DNA sequence.
منابع مشابه
Compressed Image Hashing using Minimum Magnitude CSLBP
Image hashing allows compression, enhancement or other signal processing operations on digital images which are usually acceptable manipulations. Whereas, cryptographic hash functions are very sensitive to even single bit changes in image. Image hashing is a sum of important quality features in quantized form. In this paper, we proposed a novel image hashing algorithm for authentication which i...
متن کاملA NEW SECRET SHARING SCHEME ADVERSARY FUZZY STRUCTURE BASED ON AUTOMATA
In this paper,we introduce a new verifiable multi-use multi-secretsharing scheme based on automata and one-way hash function. The scheme has theadversary fuzzy structure and satisfy the following properties:1) The dealer can change the participants and the adversary fuzzy structure without refreshing any participants' real-shadow. 2) The scheme is based on the inversion of weakly invertible fin...
متن کاملAn Improved Hash Function Based on the Tillich-Zémor Hash Function
Using the idea behind the Tillich-Zémor hash function, we propose a new hash function. Our hash function is parallelizable and its collision resistance is implied by a hardness assumption on a mathematical problem. Also, it is secure against the known attacks. It is the most secure variant of the Tillich-Zémor hash function until now.
متن کاملThe DCH Hash Function
The DCH algorithm is a byte-oriented, endian-neutral, block-cipher-based hash function. It generally follows the Merkle-Damg̊ard structure [4] [11], and compression is performed via Miyaguchi-Preneel iteration [13] on successive message blocks. Each message block consists of 504 bits (63 bytes); the block is then preprocessed to form a 512-bit input to the compression function. The algorithm use...
متن کاملNew Integrated proof Method on Iterated Hash Structure and New Structures
A secure hash structure in Random Oracle Model may not be a secure model in true design. In this paper, we give an integrated proof method on security proof of iterated hash structure. Based on the proof method, we can distinguish the security of Merkel-Damag̊ard structure, wide-pipe hash, double-pipe hash and 3c hash and know the requirement of true design on compression function, and give a ne...
متن کامل